#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <iomanip>
#define int long long  
using namespace std;
const int N = 1e5 + 10;
typedef pair<int, int> PII;
PII p[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);

    int n;
    cin >> n;
    vector<int> a(n), b(n);

    int A = 0;
    int B = 0;

    for (int i = 0; i < n; ++i)
    {
        cin >> p[i].first >> p[i].second;
        A += p[i].first;
        B += p[i].second;
        a[i] = p[i].first;
        b[i] = p[i].second;
    }

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    

    int max_a = a.back(),  sec_max_a = a[n - 2];
    int min_a = a.front(), sec_min_a = a[1];
    int max_b = b.back(),  sec_max_b = b[n - 2];
    int min_b = b.front(), sec_min_b = b[1];

    for (int i = 0; i < n; ++i) {
        int a1 = A - p[i].first;
        int b1 = B - p[i].second;
      //  cout << sec_max_a << " " << max_a << endl;
       // cout << a1 << endl;
        if (p[i].first == max_a) {
            a1 = a1 - min_a - sec_max_a;
        } else if (p[i].first == min_a) {
            a1 = a1 - sec_min_a - max_a;
        } else {
            a1 = a1 - max_a - min_a;
        }
       
       // cout << a1 << endl;

        if (p[i].second == max_b) {
            b1 = b1 - min_b - sec_max_b;
        } else if (p[i].second == min_b) {
            b1 = b1 - sec_min_b - max_b;
        } else {
            b1 = b1 - max_b - min_b;
        }

        double m1 = (a1 * 1.0 ) / ((n - 3) * 1.0);
        double m2 = (b1 * 1.0 ) / ((n - 3) * 1.0);

        //printf("%.7lf\n" , ((m1 + m2) * 1.0 / 2.0));
   
        cout << fixed << setprecision(7) << (double)((m1 + m2) * 1.0 / 2.0) << endl;
    
    }

    return 0;
}   